Experimental and Theoretical Studies on the Rearrangement of 2‐Oxoazepane α,α‐Amino Acids into 2′‐Oxopiperidine β2,3,3‐Amino Acids: An Example of Intramolecular Catalysis

Enantiopure β‐amino acids represent interesting scaffolds for peptidomimetics, foldamers and bioactive compounds. However, the synthesis of highly substituted analogues is still a major challenge. Herein, we describe the spontaneous rearrangement of 4‐carboxy‐2‐oxoazepane α,α‐amino acids to lead to 2′‐oxopiperidine‐containing β^2,3,3‐amino acids, upon basic or acid hydrolysis of the 2‐oxoazepane α,α‐amino acid ester. Under acidic conditions, a totally stereoselective synthetic route has been developed. The reordering process involved the spontaneous breakdown of an amide bond, which typically requires strong conditions, and the formation of a new bond leading to the six‐membered heterocycle. A quantum mechanical study was carried out to obtain insight into the remarkable ease of this rearrangement, which occurs at room temperature, either in solution or upon storage of the 4‐carboxylic acid substituted 2‐oxoazepane derivatives. This theoretical study suggests that the rearrangement process occurs through a concerted mechanism, in which the energy of the transition states can be lowered by the participation of a catalytic water molecule. Interestingly, it also suggested a role for the carboxylic acid at position 4 of the 2‐oxoazepane ring, which facilitates this rearrangement, participating directly in the intramolecular catalysis.     

Concurrent multiresponse non-linear screening: Robust profiling of webpage performance

Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L₉(3⁴) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.